Generating Distance Maps with Neighbourhood Sequences
نویسندگان
چکیده
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that compute the digital Euclidean distance transform. It is shown that the latter approach is not well-suited for distances based on neighbourhood sequences.
منابع مشابه
The Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کاملWeighted Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids
By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented for the face-centered cubic grid and the body-centered cubic grid. By minimizing an error function, the ...
متن کاملLattice of Distances Based on 3d-neighbourhood Sequences
In this paper we give a natural ordering relation between distances based on 3D-neighbourhood sequences. We prove that this ordering induces a complete compact distributive lattice over the set of 3D-neighbourhood sequences.
متن کاملIndexing and segmenting colour images using neighbourhood sequences
In this paper we present some methods for indexing and segmenting colour images. The proposed procedures are based on well-known algorithms, but now we use digital distance functions generated by neighbourhood sequences to measure distance between colours. The application of such distance functions is quite natural and descriptive, since the colour coordinates of the pixels are non-negative int...
متن کاملWeighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms
Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighbourhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We present conditions for metricity and algorithms to compute the distances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006